On the Finitary Bisimulation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Finitary Bisimulation

The finitely observable, or finitary, part of bisimulation is a key tool in establishing full abstraction results for denotational semantics for process algebras with respect to bisimulation-based preorders. A bisimulation-like characterization of this relation for arbitrary transition systems is given, relying on Abramsky’s characterization in terms of the finitary domain logic. More informati...

متن کامل

A Characterization of Finitary Bisimulation

Following a paradigm put forward by Milner and Plotkin, a primary criterion to judge the appropriateness of denotational models for programming and specification languages is that they be in agreement with operational intuition about program behaviour. Of the “good fit” criteria for such models that have been discussed in the literature, the most desirable one is that of full abstraction. Intui...

متن کامل

On the Reduction of Chocs Bisimulation to pi-Calculus Bisimulation

Chocs and-calculus are two extensions of CCS where, respectively, processes and channels are transmissible values. In previous work we have proposed a formalization of the notion of bisimulation for Chocs. In this paper we suggest a more eeective way to reason about this notion by means of an embedding of Chocs into a richer calculus endowed with a notion ofàctivation' channel which we christen...

متن کامل

Finitary Reducibility on Equivalence Relations

We introduce the notion of finitary computable reducibility on equivalence relations on the domain ω. This is a weakening of the usual notion of computable reducibility, and we show it to be distinct in several ways. In particular, whereas no equivalence relation can be Π n+2-complete under computable reducibility, we show that, for every n, there does exist a natural equivalence relation which...

متن کامل

On the Finitary Characterization of π-Congruences

Some alternative characterizations of late full congruences, either strong or weak, are presented. Those congruences are classically defined by requiring the corresponding ground bisimilarity under all name substitutions. We first improve on those infinitary definitions by showing that congruences can be alternatively characterized in the π-calculus by sticking to a finite number of carefully i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: BRICS Report Series

سال: 1995

ISSN: 1601-5355,0909-0878

DOI: 10.7146/brics.v2i59.19960